A sublinear-time approximation scheme for bin packing
نویسندگان
چکیده
From August 17 to August 22, 2008, the Dagstuhl Seminar 08341 Sublinear Algorithms was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
منابع مشابه
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1, . . . , an in (0, 1]. Using uniform sampling, which selects a random element from the input list each time, we develop a randomized O( n)(log log n) ∑n i=1 ai +( 1 2 ) 1 2 ) time (1+2)approximation scheme for the bin packing problem. We show that every randomized algorithm with unifo...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملSubmitted to 2001 ACM - SIAM Symp . on Discrete Algorithms Better Approximation Algorithms for Bin
Bin covering takes as input a list of item sizes and places them into bins of unit demand so as to maximize the number of bins whose demand is satissed. This is in a sense a dual problem to the classical one-dimensional bin packing problem, but has for many years lagged behind the latter as far as the quality of the best approximation algorithms. We design algorithms for this problem that close...
متن کاملA Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
“Bin packing with rejection” is the following problem: Given a list of items with associated sizes and rejection costs, find a packing into unit bins of a subset of the list such that the number of bins used plus the sum of rejection costs of unpacked items is minimized. We show that bin packing with rejection can be reduced to n multiple knapsack problems and, based on techniques for the multi...
متن کاملAn Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
In the bin covering problem there is a group L=(a1; : : : ; an) of items with sizes s̃(ai)∈ (0; 1), and the goal is to 6nd a packing of the items into bins to maximize the number of bins that receive items of total size at least 1. This is a dual problem to the classical bin packing problem. In this paper we present the 6rst asymptotic fully polynomial-time approximation scheme for the problem. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 410 شماره
صفحات -
تاریخ انتشار 2009